Multiple Left Regular Representations Generated by Alternants
نویسندگان
چکیده
منابع مشابه
Multiple Left Regular Representations Generated
Let p 1 p n 0, and p = detkx p j i k n i;j=1. Let Mp be the linear span of the partial derivatives of p. Then Mp is a graded Sn-module. We prove that it is the direct sum of graded left regular representations of Sn. Speciically, set j = p j , n , j, and let t be the Hilbert polynomial of the span of all skew Schur functions s = as varies in. Then the graded Frobenius characteristic of Mp is t ...
متن کاملDistinguished positive regular representations
Let $G$ be a tamely ramified reductive $p$-adic group. We study distinction of a class of irreducible admissible representations of $G$ by the group of fixed points $H$ of an involution of $G$. The representations correspond to $G$-conjugacy classes of pairs $(T,phi)$, where $T$ is a tamely ramified maximal torus of $G$ and $phi$ is a quasicharacter of $T$ whose restriction t...
متن کاملNon-vanishing of Alternants
Let p be prime, K a field of characteristic 0. Let (x1, . . . , xn) ∈ Kn such that xi 6= 0 for all i and xi/xj is not a root of unity for all i 6= j. We prove that there exist integers 0 < e1 < e2 < · · · < en such that det (x ei j ) 6= 0. The proof uses p-adic arguments. As corollaries, we derive the linear independence of certain Witt vectors and study the result of applying the Witt functor ...
متن کاملTHE LEFT REGULAR REPRESENTATION OF A COMMUTATIVE SEPARATIVE SEMIGROUP
In this paper, a commutative semigroup will be written as a disjoint union of its cancellative subsemigroups. Based on this fact we will define the left regular representation of a commutative separative semigroup and show that this representation is faithful. Finally concrete examples of commutative separative semigroups, their decompositions and their left regular representations are given.
متن کاملConnectivity of random regular graphs generated by the pegging algorithm
We study the connectivity of random d-regular graphs which are recursively generated by an algorithm motivated by a peer to peer network. We show that these graphs are asymptotically almost surely d-connected for any even constant d ≥ 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2000
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3089